Linear Recursive Functions
نویسندگان
چکیده
With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included in Turing-complete computation models: in this paper we show that the class of partial recursive functions that are syntactically linear (that is, partial recursive functions where no argument is erased or copied) is Turing-complete.
منابع مشابه
PWL Approximation of Non-linear Functions for the Implementation of Neuro-Fuzzy Systems
A piecewise linear (PWL) function approximation scheme is described by a lattice algebra of modified operators that allows for the interpolation of PWL function vertexes. A new recursive method called Centred Recursive Interpolation (CRI) based on such modified operators is analysed for successive function smoothing and more accurate approximation. This approximation method, simple but accurate...
متن کاملRecursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimalization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixi...
متن کاملReal Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملA recursive construction of a class of finite normalized tight frames
Finite normalized tight frames are interesting because they provide decompositions in applications and some physical interpretations. In this article, we give a recursive method for constructing them.
متن کامل